On refined generalised quasi-adequate transversals
نویسندگان
چکیده
Some properties and characterizations for abundant semigroups with generalised quasiadequate transversals are explored. In such semigroups, an interesting property [?a,b ? Re1S, VSo(a) VSo (b) 0 (a) = (b)] is investigated thus the concept of refined quasi-adequate transversals, short, RGQA introduced. It shown that real common generalisations both orthodox adequate in case. Finally, by means two R L, a spined product structure theorem semigroup quasi-ideal transversal established.
منابع مشابه
On Rees Matrix Representations of Abundant Semigroups with Adequate Transversals
The concepts of ∗-relation of a (Γ-)semigroup and Γ̄-adequate transversal of a (Γ-)abundant semigroup are defined in this note. Then we develop a matrix type theory for abundant semigroups. We give some equivalent conditions of a Rees matrix semigroup being abundant and some equivalent conditions of an abundant Rees matrix semigroup having an adequate transversal. Then we obtain some Rees matrix...
متن کاملOn the quasi-transversals of a matroid
We show that the set of r-quasi-transversals of a matroid, if nonempty, is the set of bases of a matroid. We also give an alternative proof of the known theorem which identifies the conjugate of the rank partition of a matroid.
متن کاملNotes on Convex Transversals
In this paper, we prove the problem of stabbing a set of disjoint bends by a convex stabber to be NP-hard. We also consider the optimization version of the convex stabber problem and prove this problem to be APX-hard for sets of line segments.
متن کاملCommon Transversals
Given t families, each family consisting of s finite sets, we show that if the families “separate points" in a natural way, and if the union of all the sets in all the families contains more than (s+1)t st 1 1 elements, then a common transversal of the t families exists. In case each family is a covering family, the bound is st st 1. Both of these bounds are best possible. This work extends rec...
متن کاملConvex Transversals
We answer the question initially posed by Arik Tamir at the Fourth NYU Computational Geometry Day (March, 1987): “Given a collection of compact sets, can one decide in polynomial time whether there exists a convex body whose boundary intersects every set in the collection?” We prove that when the sets are segments in the plane, deciding existence of the convex stabber is NP-hard. The problem re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2021
ISSN: ['2406-0933', '0354-5180']
DOI: https://doi.org/10.2298/fil2101299k